package algorithm.recursionAndbacktrack.p37;

/**
 * 37. 解数独
 */
class Solution {
    private int m;
    private int n;
    public void solveSudoku(char[][] board) {
        m = board.length;       // 9行
        n = board[0].length;    // 9列

        solveSudoku(board, 0, 0);
    }

    private void solveSudoku(char[][] board, int row, int col) {

        for (int i = 0; i < n; i++) {

        }
    }

    public static void main(String[] args) {
        char[][] board = {{'5','3','.'  ,'.','7','.'  ,'.','.','.'},
                          {'6','.','.'  ,'1','9','5'  ,'.','.','.'},
                          {'.','9','8'  ,'.','.','.'  ,'.','6','.'},

                          {'8','.','.'  ,'.','6','.'  ,'.','.','3'},
                          {'4','.','.'  ,'8','.','3'  ,'.','.','1'},
                          {'7','.','.'  ,'.','2','.'  ,'.','.','6'},

                          {'.','6','.'  ,'.','.','.'  ,'2','8','.'},
                          {'.','.','.'  ,'4','1','9'  ,'.','.','5'},
                          {'.','.','.'  ,'.','8','.'  ,'.','7','9'}};
        new Solution().solveSudoku(board);
    }
}